package tree;

public class Node<K,V> {
    //存储键,用于节点的大小比较
    public K key;
    //存储值
    public V value;
    //记录左子结点
    public Node<K,V> left;
    //记录右子结点
    public Node<K,V> right;

    public Node(K key, V value, Node<K,V> left, Node<K,V> right) {
        this.key = key;
        this.value = value;
        this.left = left;
        this.right = right;
    }
}
